Buscar
Mostrando ítems 1-10 de 85
Similarity joins and beyond: an extended set of binary operators with order
(SpringerCham, 2015)
Similarity joins are troublesome database operators that often produce results much larger than the user really needs or expects. In order to return the similar elements, similarity joins also require sorting during the ...
Diversity in similarity joins
(SpringerCham, 2015)
With the increasing ability of current applications to produce and consume more complex data, such as images and geographic information, the similarity join has attracted considerable attention. However, this operator does ...
Double distance-calculation-pruning for similarity search
(2018-05-17)
Many modern applications deal with complex data, where retrieval by similarity plays an important role. Complex data main comparison mechanisms are based on similarity predicates. They are usually immersed in metric spaces ...
Lift-and-project ranks of the stable set polytope of joined a-perfect graphs
(Elsevier Science, 2016-09)
In this paper we study lift-and-project polyhedral operators defined by Lovász and Schrijver and Balas, Ceria and Cornuéjols on the clique relaxation of the stable set polytope of webs. We compute the disjunctive rank of ...
Inference engine based on closure and join operators over Truth Table Binary Relations
(Elsevier, 2014-02)
We propose a conceptual reasoning method for an inference engine. Starting from a knowledge base made of decision rules, we first map each rule to its corresponding Truth Table Binary Relation (TTBR), considered as a formal ...
A semi-automatic parallelization tool for Java based on fork-join synchronization patterns
(Sociedad Argentina de Informática E Investigación Operativa, 2013-11)
Because of the increasing availability of multi-core machines, clusters, Grids, and combinations of these environments, there is now plenty of computational power available for executing compute intensive applications. ...
Generalized limited packings of some graphs with a limited number of P4-partners
(Elsevier Science, 2015-05)
By using modular decomposition and handling certain graph operations such as join and union, we show that the Generalized Limited Packing Problem—NP-complete in general—can be solved in polynomial time in some graph classes ...
Operators which are the difference of two projections
(Elsevier, 2014-11)
We study the set D of differences
D={A=P−Q:P,Q∈P},
where P denotes the set of orthogonal projections in H. We describe models and factorizations for elements in D, which are related to the geometry of P. The study of D ...
The SB-index and the HSB-index: efficient indices for spatial data warehouses
(SPRINGERDORDRECHT, 2012)
Spatial data warehouses (SDWs) allow for spatial analysis together with analytical multidimensional queries over huge volumes of data. The challenge is to retrieve data related to ad hoc spatial query windows according to ...
Rearrangement-Based Phylogeny Using the Single-Cut-or-Join Operation
(Ieee Computer SocLos AlamitosEUA, 2013)